Performance Analysis of a Renewal Input Bulk Service Queue with Accessible and Non-accessible Batches
نویسندگان
چکیده
Abstract: In this paper, we consider a single-server infinite(finite-) buffer bulk-service queues. The interarrival and service times are respectively, arbitrarily and exponentially distributed. The customers are served by a single server in accessible or non-accessible batches of maximum size ‘ b ’ with a minimum threshold value ‘ ’. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state queue length distributions at prearrival and arbitrary epochs. Finally, some numerical results have been presented. a
منابع مشابه
ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملA Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...
متن کاملON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION
This paper analyzes a renewal input working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a
متن کاملANALYSIS OF RENEWAL INPUT STATE DEPENDENT VACATION QUEUE WITH $N$-POLICY
This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical computations in the form of graphs are presented to show the par...
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کامل